A Note on Gallager's Capacity Theorem for Waveform Channels

نویسنده

  • Edwin Hammerich
چکیده

We correct an alleged contradiction to Gallager’s capacity theorem for waveform channels as presented in a poster at the 2012 IEEE International Symposium on Information Theory. 1 Brief Description of the Poster [2] Gallager’s capacity theorem [1, Theorem 8.5.1] is literally reproduced on p. 1 of the poster along with the figure [1, Figure 8.5.1] plus some explanations taken from Gallager’s book [1]. On p. 2, the so-called Gallager channel (now called Gaussian waveform channel), i.e., a Gaussian filter with additive white Gaussian noise (AWGN), is treated as a special instance of Gallager’s theorem. On p. 3, the heat channel, a linear time-varying (LTV) filter with AWGN, is depicted followed by a characterization of its capacity by water-filling in the time-frequency plane [4, Theorem 2]. Finally, on p. 4, an example of a signal transmission is given aiming at underpinning the apparent contradiction to Gallager’s theorem in Figs. 3 and 4 of the poster. The curves for the heat channel in the latter two figures are incorrect; the correct curves are provided in the present publication. 2 Capacity of the Heat Channel Revisited Evaluation of the double integrals occurring in the water-filling theorem [4, Theorem 2] (cf. p. 3 of [2]) and subsequent elimination of the parameter ν results in the closed-form representation of the capacity (in nats per transmission) of the heat channel, namely C(S) = αβ 2 [

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Gallager's error exponent analysis of STBC systems over η-μ fading channels

The Gallager’s random coding error exponent for space-time block codes (STBC) over multiple-input multipleoutput (MIMO) block-fading channels, with Gaussian input distribution, is investigated. Gallager’s error exponent can be used to determine the required codeword length to achieve a prescribed error probability at a given rate below the channel capacity. We first provide new, analytical expr...

متن کامل

Gallager's Exponent Analysis of STBC MIMO Systems over η-μ and κ-μ Fading Channels

In this paper, we analytically investigate Gallager’s exponent for space-time block codes over multiple-input multipleoutput block-fading channels with Gaussian input distribution. As a suitable metric of the fundamental tradeoff between communication reliability and information rate, Gallager’s exponent can be used to determine the required codeword length to achieve a prescribed error probabi...

متن کامل

A note on spectral mapping theorem

This paper aims to present the well-known spectral mapping theorem for multi-variable functions.

متن کامل

A Note on the Descent Property Theorem for the Hybrid Conjugate Gradient Algorithm CCOMB Proposed by Andrei

In [1] (Hybrid Conjugate Gradient Algorithm for Unconstrained Optimization J. Optimization. Theory Appl. 141 (2009) 249 - 264), an efficient hybrid conjugate gradient algorithm, the CCOMB algorithm is proposed for solving unconstrained optimization problems. However, the proof of Theorem 2.1 in [1] is incorrect due to an erroneous inequality which used to indicate the descent property for the s...

متن کامل

Gallager's exponent for MIMO channels: A reliability-rate tradeoff Citation

In this paper, we derive Gallager’s random coding error exponent for multiple-input multiple-output (MIMO) Rayleigh block-fading channels, assuming no channel-state information (CSI) at the transmitter and perfect CSI at the receiver. This measure gives insight into a fundamental tradeoff between the communication reliability and information rate of MIMO channels, enabling to determine the requ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • CoRR

دوره abs/1207.4707  شماره 

صفحات  -

تاریخ انتشار 2012